Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
نویسندگان
چکیده
The spectral theory of higher-order symmetric tensors is an important tool for revealing some important properties of a hypergraph via its adjacency tensor, Laplacian tensor, and signless Laplacian tensor. Owing to the sparsity of these tensors, we propose an efficient approach to calculate products of these tensors and any vectors. By using the state-of-the-art L-BFGS approach, we develop a first-order optimization algorithm for computing Hand Z-eigenvalues of these large scale sparse tensors (CEST). With the aid of the Lojasiewicz inequality, we prove that the sequence of iterates generated by CEST converges to an eigenvector of the tensor. When CEST is started from multiple random initial points, the resulting best eigenvalue could touch the extreme eigenvalue with a high probability. Finally, numerical experiments on small hypergraphs show that CEST is efficient and promising. Moreover, CEST is capable of computing eigenvalues of tensors related to a hypergraph with millions of vertices.
منابع مشابه
Krylov Subspace Methods for Tensor Computations
A couple of generalizations of matrix Krylov subspace methods to tensors are presented. It is shown that a particular variant can be interpreted as a Krylov factorization of the tensor. A generalization to tensors of the Krylov-Schur method for computing matrix eigenvalues is proposed. The methods are intended for the computation of lowrank approximations of large and sparse tensors. A few nume...
متن کاملH-eigenvalues of Laplacian and Signless Laplacian Tensors
We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors. We show that each of the Laplacian tensor, the signless Laplacian tensor, and the adjacency tensor has at most one H-eigenva...
متن کاملInverse Iteration for Purely Imaginary Eigenvalues with Application to the Detection of Hopf Bifurcations in Large-Scale Problems
The detection of a Hopf bifurcation in a large scale dynamical system that depends on a physical parameter often consists of computing the right-most eigenvalues of a sequence of large sparse eigenvalue problems. Guckenheimer et. al. (SINUM, 34, (1997) pp. 1-21) proposed a method that computes a value of the parameter that corresponds to a Hopf point without actually computing right-most eigenv...
متن کاملShift-and-invert iteration for purely imaginary eigenvalues with application to the detection of Hopf Bifurcations in large scale problems
The detection of a Hopf bifurcation in a large scale dynamical system that depends on a physical parameter often consists of computing the right-most eigenvalues of a sequence of large sparse eigenvalue problems. This is not only an expensive operation, but the computation of right-most eigenvalues is often not reliable for the commonly used methods for large sparse matrices. In the literature ...
متن کاملThe Laplacian of a uniform hypergraph
In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a k-uniform hypergraph. We show that the real parts of all the eigenvalues of the Laplacian are in the interval [0, 2], and the real part is zero (respectively two) if and only if the eigenvalue is zero (respectively two). All the H+-eigenvalues of the Laplacian and all the smallest H+-eigenvalues of its sub-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 38 شماره
صفحات -
تاریخ انتشار 2016